Studying the ML Module System in Hol
نویسندگان
چکیده
Building on work done by Myra VanInwegen and Elsa Gunter, we encode the dynamic semantics of the Module system of SML in HOL. We extend this to a possible dynamic semantics for a Module system with higher order functors. We relate these two semantics by embeddings and projections and outline how we are using these to state and prove that the new evaluation relations conservatively extend the old ones.
منابع مشابه
Steps towards Verified Implementations of HOL Light
This short paper describes our plans and progress towards construction of verified ML implementations of HOL Light: the first formally proved soundness result for an LCF-style prover. Building on Harrison’s formalisation of the HOL Light logic and our previous work on proof-producing synthesis of ML, we have produced verified implementations of each of HOL Light’s kernel functions. What remains...
متن کاملReasoning with the Formal Definition of Standard ML in HOL
This paper describes the results of a project to embed the Formal Deenition of the Standard ML Core language into the HOL mechanized reasoning system. HOL theories of the Core syntax and dynamic semantics are presented, including a purely deenitional representation of the semantic inference rules. The correctness of the representation is demonstrated by the derivation of several important langu...
متن کاملFormalising, improving, and reusing the Java module system
Java has no module system. Its packages only subdivide the class namespace, allowing only a very limited form of component-level information hiding. A Java Community Process has started designing the Java Module System, a module system for Java 7, the next version of Java. The extensive draft of the design is written only in natural language documents, which inevitably contain many ambiguities....
متن کاملUniversity of Essex , England Technical Report CSM - 343 A Deep Embedding of Z C in Isabelle / HOL
This report describes a deep embedding of the logic ZC [HR00] in Isabelle/HOL. The development is based on a general theory of de Bruijn terms. Wellformed terms, propositions and judgements are represented as inductive sets. The embedding is used to prove elementary properties of ZC such as uniqueness of types, type inhabitation and that elements of judgements are wellformed propositions
متن کاملHOL with Definitions: Semantics, Soundness, and a Verified Implementation
We present a mechanised semantics and soundness proof for the HOL Light kernel including its definitional principles, extending Harrison’s verification of the kernel without definitions. Soundness of the logic extends to soundness of a theorem prover, because we also show that a synthesised implementation of the kernel in CakeML refines the inference system. Our semantics is the first for Wiedi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994